Search for: All records

The current in-situ, descriptive case study demonstrated how we involved in-service teachers as informants in designing an educational game to enhance middle school students’ computational thinking through participatory design. Data were collected from eight in-service teachers at middle schools through individual interviews, focus groups, and field notes. The study results indicated that in-service teachers made 82% of contributions to the Learning facet, followed by 14% of the Gameplay facet, at the early stage of conceptualization. Additionally, participants provided insights on intrinsically embedding content in game design processes by offering valuable and relevant pedagogical content knowledge, including knowledge of content and students, knowledge of content and teaching, and knowledge of content and curriculum. 

The ability to assess sleep at home, capture sleep stages, and detect the occurrence of apnea (without on-body sensors) simply by analyzing the radio waves bouncing off people's bodies while they sleep is quite powerful. Such a capability would allow for longitudinal data collection in patients' homes, informing our understanding of sleep and its interaction with various diseases and their therapeutic responses, both in clinical trials and routine care. In this article, we develop an advanced machine learning algorithm for passively monitoring sleep and nocturnal breathing from radio waves reflected off people while asleep. Validation results in comparison with the gold standard (i.e., polysomnography) (n=849) demonstrate that the model captures the sleep hypnogram (with an accuracy of 81% for 30-second epochs categorized into Wake, Light Sleep, Deep Sleep, or REM), detects sleep apnea (AUROC = 0.88), and measures the patient's Apnea-Hypopnea Index (ICC=0.95; 95% CI = [0.93, 0.97]). Notably, the model exhibits equitable performance across race, sex, and age. Moreover, the model uncovers informative interactions between sleep stages and a range of diseases including neurological, psychiatric, cardiovascular, and immunological disorders. These findings not only hold promise for clinical practice and interventional trials but also underscore the significance of sleep as a fundamental component in understanding and managing various diseases. 

Nonlinear monotone transformations are used extensively in normalizing flows to construct invertible triangular mappings from simple distributions to complex ones. In existing literature, monotonicity is usually enforced by restricting function classes or model parameters and the inverse transformation is often approximated by root-finding algorithms as a closed-form inverse is unavailable. In this paper, we introduce a new integral-based approach termed: Atomic Unrestricted Time Machine (AUTM), equipped with unrestricted integrands and easy-to-compute explicit inverse. AUTM offers a versatile and efficient way to the design of normalizing flows with explicit inverse and unrestricted function classes or parameters. Theoretically, we present a constructive proof that AUTM is universal: all monotonic normalizing flows can be viewed as limits of AUTM flows. We provide a concrete example to show how to approximate any given monotonic normalizing flow using AUTM flows with guaranteed convergence. Our result implies that AUTM can be used to transform an existing flow into a new one equipped with explicit inverse and unrestricted parameters. The performance of the new approach is evaluated on high dimensional density estimation, variational inference and image generation. 

reveal the mechanism of intermittent coupling, where the nodes are connected merely in discontinuous time durations. Instead of the common weighted average technique, by proposing a direct error method and constructing piecewise Lyapunov functions, several intermittently adaptive designs are developed to update the complex-valued coupling weights. Especially, an adaptive pinning protocol is designed for ICCVNs with heterogeneous coupling weights and the synchronization is ensured by piecewise adjusting the complex-valued weights of edges within a spanning tree. For ICCVNs with homogeneous coupling weights, based on a connected dominating set, an intermittently adaptive algorithm is developed which just depends on the information of the dominating set with their neighbors. At the end, the established theoretical results are verified by providing two numerical examples.